Improved Asymmetric Cipher Based on Matrix Power Function with Provable Security
نویسندگان
چکیده
منابع مشابه
Improved Asymmetric Cipher Based on Matrix Power Function with Provable Security
Eligijus Sakalauskas 1, Aleksejus Mihalkovich 1,* and Algimantas Venčkauskas 2 1 Faculty of Mathematics and Natural Sciences, Department of Applied Mathematics, Kaunas University of Technology, Studentu str. 50-324, Kaunas LT 51368, Lithuania; [email protected] 2 Faculty of Informatics, Department of Computer Science, Kaunas University of Technology, Studentu str. 50-213, Kaunas LT 51...
متن کاملNew Asymmetric Cipher of Non-Commuting Cryptography Class Based on Matrix Power Function
Abstract. New asymmetric cipher based on matrix power function is presented. Cipher belongs to the class of recently intensively evolving non-commuting cryptography due to expectation of its resistance to potential quantum cryptanalysis. The algebraic structures for proposed cipher construction are defined. Security analysis was performed and security parameters are defined. On the base of this...
متن کاملSecurity Analysis of Asymmetric Cipher Protocol Based on Matrix Decomposition Problem
The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is based on matrix decomposition problem (MDP), which is linked to the problem of solution of multivariate polynomial system of equations. Compromitation of proposed scheme relies on the solution of system of multivariate ...
متن کاملQUAD: A Practical Stream Cipher with Provable Security
We introduce a practical synchronous stream cipher with provable security named QUAD. The cipher relies on the iteration of a multivariate quadratic system of m equations in n < m unknowns over a finite field. The security of QUAD is provably reducible to the conjectured intractability of the MQ problem, namely solving a multivariate system of quadratic equations.
متن کاملProvable Security against Impossible Differential Cryptanalysis Application to CS-Cipher
In this document we present a new way to bound the probability of occurrence of an n-round differential in the context of differential cryptanalysis. Hence this new model allows us to claim proof of resistance against impossible differential cryptanalysis, as defined by Biham and al. in 1999. This work will be described through the example of CS-Cipher, to which, assuming some non-trivial hypot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2017
ISSN: 2073-8994
DOI: 10.3390/sym9010009